SCOPE: A Situation Calculus Ontology of Petri Nets
نویسنده
چکیده
By axiomatizing the semantics of Petri nets as a first-order (mostly) formal ontology called SCOPE, we propose in this paper a framework for the analysis of the structural and dynamical properties of Petri nets. More precisely, SCOPE is built as a Basic Action Theory in Reiter’s version of situation calculus. In addition, we show the satisfiability of SCOPE, by virtue of the Relative Satisfiability Theorem. Fundamental structural and dynamical properties of Petri nets described in SCOPE are also presented, with two example uses of SCOPE given.
منابع مشابه
Concurrent Execution Semantics of DAML-S with Subtypes
The DARPA Agent Markup Language ontology for Services (DAML-S) enables the description of Web-based services, such that they can be discovered, accessed and composed dynamically by intelligent software agents and other Web services, thereby facilitating the coordination between distributed, heterogeneous systems on the Web. We propose a formalised syntax and an initial reference semantics for D...
متن کاملSoccer Goalkeeper Task Modeling and Analysis by Petri Nets
In a robotic soccer team, goalkeeper is an important challenging role, which has different characteristics from the other teammates. This paper proposes a new learning-based behavior model for a soccer goalkeeper robot by using Petri nets. The model focuses on modeling and analyzing, both qualitatively and quantitatively, for the goalkeeper role so that we have a model-based knowledge of the ta...
متن کاملA rule-based evaluation of ladder logic diagram and timed petri nets for programmable logic controllers
This paper describes an evaluation through a case study by measuring a rule-based approach, which proposed for ladder logic diagrams and Petri nets. In the beginning, programmable logic controllers were widely designed by ladder logic diagrams. When complexity and functionality of manufacturing systems increases, developing their software is becoming more difficult. Thus, Petri nets as a high l...
متن کاملPetri Nets Semantics of P-calculus
As p-calculus based on the interleaving semantics cannot depict the true concurrency and has few supporting tools, it is translated into Petri nets. p-calculus is divided into basic elements, sequence, concurrency, choice and recursive modules. These modules are translated into Petri nets to construct a complicated system. Petri nets semantics for p-calculus visualize system structure as well a...
متن کاملUsing Interval Petri Nets and Timed Automata for Diagnosis of Discrete Event Systems (DES)
A discrete event system (DES) is a dynamic system that evolves in accordance with the abrupt occurrence, at possibly unknown irregular intervals, of physical events. Because of the special nature of these systems, different tools are currently used for their analysis, design and modeling. The main focus of this paper is the presentation of a new modeling approach of Discrete Event Systems. The ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010